Inverse plan optimization accounting for random geometric uncertainties with a multiple instance geometry approximation (MIGA)
نویسندگان
چکیده
منابع مشابه
On the bounds in Poisson approximation for independent geometric distributed random variables
The main purpose of this note is to establish some bounds in Poisson approximation for row-wise arrays of independent geometric distributed random variables using the operator method. Some results related to random sums of independent geometric distributed random variables are also investigated.
متن کاملApproximation Algorithms for Geometric Optimization Problems
This thesis deals with a number of geometric optimization problems which are all NP-hard. The first problem we consider is the set cover problem for polytopes in R3. Here, we are given a set of points in R3 and a fixed set of translates of an arbitrary polytope. We would like to select a subset of the given polytopes such that each input point is covered by at least one polytope and the number ...
متن کاملA Deterministic Approximation Method in Shape Optimization under Random Uncertainties: Supplementary Material
1. Additional numerical examples 1 1.1. Minimization of the mean value of a least-square criterion under material uncertainties 1 1.2. Minimization of the mean value and of the variance of the compliance of a crane 3 1.3. Minimization of the stress of an L-shaped beam under uncertainties over its geometry 4 2. Some useful facts around shape derivatives and tangential calculus 5 2.1. Extension o...
متن کاملA Conditional Random Field for Multiple-Instance Learning
We present MI-CRF, a conditional random field (CRF) model for multiple instance learning (MIL). MI-CRF models bags as nodes in a CRF with instances as their states. It combines discriminative unary instance classifiers and pairwise dissimilarity measures. We show that both forces improve the classification performance. Unlike other approaches, MI-CRF considers all bags jointly during training a...
متن کاملRobust multiple-instance learning ensembles using random subspace instance selection
Many real-world pattern recognition problems can be modeled using multiple-instance learning (MIL), where instances are grouped into bags, and each bag is assigned a label. State-of-the-art MIL methods provide a high level of performance when strong assumptions are made regarding the underlying data distributions, and the proportion of positive to negative instances in positive bags. In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Medical Physics
سال: 2006
ISSN: 0094-2405
DOI: 10.1118/1.2191016